TSTP Solution File: CSR141^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR141^1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:34:38 EDT 2024
% Result : Theorem 0.19s 0.47s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 18
% Syntax : Number of formulae : 37 ( 8 unt; 11 typ; 0 def)
% Number of atoms : 87 ( 0 equ; 0 cnn)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 248 ( 38 ~; 28 |; 10 &; 168 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 7 con; 0-3 aty)
% Number of variables : 24 ( 0 ^ 24 !; 0 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
agent_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_23,type,
connected_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_24,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(decl_25,type,
instance_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_26,type,
lCADE_BM_THFTYPE_i: $i ).
thf(decl_27,type,
lMariaPaola_THFTYPE_i: $i ).
thf(decl_28,type,
lMeeting_THFTYPE_i: $i ).
thf(decl_29,type,
lReiner_THFTYPE_i: $i ).
thf(decl_30,type,
lWhenFn_THFTYPE_IiiI: $i > $i ).
thf(decl_31,type,
lNear_THFTYPE_i: $i ).
thf(decl_32,type,
orientation_THFTYPE_IiiioI: $i > $i > $i > $o ).
thf(con,conjecture,
( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ lCADE_BM_THFTYPE_i )
@ ~ ( connected_THFTYPE_IiioI @ lMariaPaola_THFTYPE_i @ lReiner_THFTYPE_i ) ),
file('/export/starexec/sandbox2/tmp/tmp.iu04a43FNQ/E---3.1_27774.p',con) ).
thf(ax_004,axiom,
! [X1: $i,X2: $i,X3: $i] :
( ( ( instance_THFTYPE_IiioI @ X1 @ lMeeting_THFTYPE_i )
& ( agent_THFTYPE_IiioI @ X1 @ X3 )
& ( agent_THFTYPE_IiioI @ X1 @ X2 ) )
=> ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ X1 ) @ ( orientation_THFTYPE_IiiioI @ X3 @ X2 @ lNear_THFTYPE_i ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.iu04a43FNQ/E---3.1_27774.p',ax_004) ).
thf(ax_005,axiom,
! [X4: $i,X5: $i] :
( ( orientation_THFTYPE_IiiioI @ X4 @ X5 @ lNear_THFTYPE_i )
=> ~ ( connected_THFTYPE_IiioI @ X4 @ X5 ) ),
file('/export/starexec/sandbox2/tmp/tmp.iu04a43FNQ/E---3.1_27774.p',ax_005) ).
thf(ax_003,axiom,
holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ lCADE_BM_THFTYPE_i ) @ $true,
file('/export/starexec/sandbox2/tmp/tmp.iu04a43FNQ/E---3.1_27774.p',ax_003) ).
thf(ax_002,axiom,
instance_THFTYPE_IiioI @ lCADE_BM_THFTYPE_i @ lMeeting_THFTYPE_i,
file('/export/starexec/sandbox2/tmp/tmp.iu04a43FNQ/E---3.1_27774.p',ax_002) ).
thf(ax,axiom,
agent_THFTYPE_IiioI @ lCADE_BM_THFTYPE_i @ lReiner_THFTYPE_i,
file('/export/starexec/sandbox2/tmp/tmp.iu04a43FNQ/E---3.1_27774.p',ax) ).
thf(ax_001,axiom,
agent_THFTYPE_IiioI @ lCADE_BM_THFTYPE_i @ lMariaPaola_THFTYPE_i,
file('/export/starexec/sandbox2/tmp/tmp.iu04a43FNQ/E---3.1_27774.p',ax_001) ).
thf(c_0_7,negated_conjecture,
~ ( ( ( connected_THFTYPE_IiioI @ lMariaPaola_THFTYPE_i @ lReiner_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ lCADE_BM_THFTYPE_i ) @ $true ) )
& ( ~ ( connected_THFTYPE_IiioI @ lMariaPaola_THFTYPE_i @ lReiner_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ lCADE_BM_THFTYPE_i ) @ $false ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[con])])]) ).
thf(c_0_8,axiom,
! [X1: $i,X2: $i,X3: $i] :
( ( ( instance_THFTYPE_IiioI @ X1 @ lMeeting_THFTYPE_i )
& ( agent_THFTYPE_IiioI @ X1 @ X3 )
& ( agent_THFTYPE_IiioI @ X1 @ X2 ) )
=> ( ( ~ ( orientation_THFTYPE_IiiioI @ X3 @ X2 @ lNear_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ X1 ) @ $true ) )
& ( ( orientation_THFTYPE_IiiioI @ X3 @ X2 @ lNear_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ X1 ) @ $false ) ) ) ),
inference(fool_unroll,[status(thm)],[ax_004]) ).
thf(c_0_9,negated_conjecture,
( ( ( connected_THFTYPE_IiioI @ lMariaPaola_THFTYPE_i @ lReiner_THFTYPE_i )
| ~ ( connected_THFTYPE_IiioI @ lMariaPaola_THFTYPE_i @ lReiner_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ lCADE_BM_THFTYPE_i ) @ $false )
| ~ ( connected_THFTYPE_IiioI @ lMariaPaola_THFTYPE_i @ lReiner_THFTYPE_i ) )
& ( ( connected_THFTYPE_IiioI @ lMariaPaola_THFTYPE_i @ lReiner_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ lCADE_BM_THFTYPE_i ) @ $true ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ lCADE_BM_THFTYPE_i ) @ $false )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ lCADE_BM_THFTYPE_i ) @ $true ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
thf(c_0_10,plain,
! [X4: $i,X5: $i] :
( ( orientation_THFTYPE_IiiioI @ X4 @ X5 @ lNear_THFTYPE_i )
=> ~ ( connected_THFTYPE_IiioI @ X4 @ X5 ) ),
inference(fof_simplification,[status(thm)],[ax_005]) ).
thf(c_0_11,plain,
! [X11: $i,X12: $i,X13: $i] :
( ( ~ ( orientation_THFTYPE_IiiioI @ X13 @ X12 @ lNear_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ X11 ) @ $true )
| ~ ( instance_THFTYPE_IiioI @ X11 @ lMeeting_THFTYPE_i )
| ~ ( agent_THFTYPE_IiioI @ X11 @ X13 )
| ~ ( agent_THFTYPE_IiioI @ X11 @ X12 ) )
& ( ( orientation_THFTYPE_IiiioI @ X13 @ X12 @ lNear_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ X11 ) @ $false )
| ~ ( instance_THFTYPE_IiioI @ X11 @ lMeeting_THFTYPE_i )
| ~ ( agent_THFTYPE_IiioI @ X11 @ X13 )
| ~ ( agent_THFTYPE_IiioI @ X11 @ X12 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
thf(c_0_12,negated_conjecture,
( ~ ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ lCADE_BM_THFTYPE_i ) @ ~ $true )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ lCADE_BM_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_13,plain,
holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ lCADE_BM_THFTYPE_i ) @ $true,
inference(split_conjunct,[status(thm)],[ax_003]) ).
thf(c_0_14,plain,
! [X14: $i,X15: $i] :
( ~ ( orientation_THFTYPE_IiiioI @ X14 @ X15 @ lNear_THFTYPE_i )
| ~ ( connected_THFTYPE_IiioI @ X14 @ X15 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
thf(c_0_15,plain,
! [X1: $i,X3: $i,X2: $i] :
( ( orientation_THFTYPE_IiiioI @ X1 @ X2 @ lNear_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ X3 ) @ ~ $true )
| ~ ( instance_THFTYPE_IiioI @ X3 @ lMeeting_THFTYPE_i )
| ~ ( agent_THFTYPE_IiioI @ X3 @ X1 )
| ~ ( agent_THFTYPE_IiioI @ X3 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_16,plain,
instance_THFTYPE_IiioI @ lCADE_BM_THFTYPE_i @ lMeeting_THFTYPE_i,
inference(split_conjunct,[status(thm)],[ax_002]) ).
thf(c_0_17,negated_conjecture,
~ ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ lCADE_BM_THFTYPE_i ) @ ~ $true ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
thf(c_0_18,plain,
! [X1: $i,X2: $i] :
( ~ ( orientation_THFTYPE_IiiioI @ X1 @ X2 @ lNear_THFTYPE_i )
| ~ ( connected_THFTYPE_IiioI @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_19,plain,
! [X2: $i,X1: $i] :
( ( orientation_THFTYPE_IiiioI @ X1 @ X2 @ lNear_THFTYPE_i )
| ~ ( agent_THFTYPE_IiioI @ lCADE_BM_THFTYPE_i @ X2 )
| ~ ( agent_THFTYPE_IiioI @ lCADE_BM_THFTYPE_i @ X1 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
thf(c_0_20,negated_conjecture,
( ( connected_THFTYPE_IiioI @ lMariaPaola_THFTYPE_i @ lReiner_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ lCADE_BM_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_21,plain,
! [X2: $i,X1: $i] :
( ~ ( agent_THFTYPE_IiioI @ lCADE_BM_THFTYPE_i @ X1 )
| ~ ( agent_THFTYPE_IiioI @ lCADE_BM_THFTYPE_i @ X2 )
| ~ ( connected_THFTYPE_IiioI @ X2 @ X1 ) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_22,negated_conjecture,
connected_THFTYPE_IiioI @ lMariaPaola_THFTYPE_i @ lReiner_THFTYPE_i,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_13])]) ).
thf(c_0_23,plain,
agent_THFTYPE_IiioI @ lCADE_BM_THFTYPE_i @ lReiner_THFTYPE_i,
inference(split_conjunct,[status(thm)],[ax]) ).
thf(c_0_24,plain,
agent_THFTYPE_IiioI @ lCADE_BM_THFTYPE_i @ lMariaPaola_THFTYPE_i,
inference(split_conjunct,[status(thm)],[ax_001]) ).
thf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR141^1 : TPTP v8.1.2. Released v4.1.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n024.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri May 3 15:18:22 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.19/0.46 Running higher-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.iu04a43FNQ/E---3.1_27774.p
% 0.19/0.47 # Version: 3.1.0-ho
% 0.19/0.47 # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.47 # Starting full_lambda_5 with 300s (1) cores
% 0.19/0.47 # Starting new_ho_10_unif with 300s (1) cores
% 0.19/0.47 # full_lambda_5 with pid 27854 completed with status 0
% 0.19/0.47 # Result found by full_lambda_5
% 0.19/0.47 # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.47 # Starting full_lambda_5 with 300s (1) cores
% 0.19/0.47 # No SInE strategy applied
% 0.19/0.47 # Search class: HGHNF-FFSS11-SFFFFFNN
% 0.19/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.47 # new_ho_10 with pid 27858 completed with status 0
% 0.19/0.47 # Result found by new_ho_10
% 0.19/0.47 # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.47 # Starting full_lambda_5 with 300s (1) cores
% 0.19/0.47 # No SInE strategy applied
% 0.19/0.47 # Search class: HGHNF-FFSS11-SFFFFFNN
% 0.19/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.47 # Preprocessing time : 0.001 s
% 0.19/0.47 # Presaturation interreduction done
% 0.19/0.47
% 0.19/0.47 # Proof found!
% 0.19/0.47 # SZS status Theorem
% 0.19/0.47 # SZS output start CNFRefutation
% See solution above
% 0.19/0.47 # Parsed axioms : 19
% 0.19/0.47 # Removed by relevancy pruning/SinE : 0
% 0.19/0.47 # Initial clauses : 23
% 0.19/0.47 # Removed in clause preprocessing : 13
% 0.19/0.47 # Initial clauses in saturation : 10
% 0.19/0.47 # Processed clauses : 21
% 0.19/0.47 # ...of these trivial : 0
% 0.19/0.47 # ...subsumed : 0
% 0.19/0.47 # ...remaining for further processing : 21
% 0.19/0.47 # Other redundant clauses eliminated : 0
% 0.19/0.47 # Clauses deleted for lack of memory : 0
% 0.19/0.47 # Backward-subsumed : 1
% 0.19/0.47 # Backward-rewritten : 0
% 0.19/0.47 # Generated clauses : 4
% 0.19/0.47 # ...of the previous two non-redundant : 3
% 0.19/0.47 # ...aggressively subsumed : 0
% 0.19/0.47 # Contextual simplify-reflections : 0
% 0.19/0.47 # Paramodulations : 4
% 0.19/0.47 # Factorizations : 0
% 0.19/0.47 # NegExts : 0
% 0.19/0.47 # Equation resolutions : 0
% 0.19/0.47 # Disequality decompositions : 0
% 0.19/0.47 # Total rewrite steps : 4
% 0.19/0.47 # ...of those cached : 1
% 0.19/0.47 # Propositional unsat checks : 0
% 0.19/0.47 # Propositional check models : 0
% 0.19/0.47 # Propositional check unsatisfiable : 0
% 0.19/0.47 # Propositional clauses : 0
% 0.19/0.47 # Propositional clauses after purity: 0
% 0.19/0.47 # Propositional unsat core size : 0
% 0.19/0.47 # Propositional preprocessing time : 0.000
% 0.19/0.47 # Propositional encoding time : 0.000
% 0.19/0.47 # Propositional solver time : 0.000
% 0.19/0.47 # Success case prop preproc time : 0.000
% 0.19/0.47 # Success case prop encoding time : 0.000
% 0.19/0.47 # Success case prop solver time : 0.000
% 0.19/0.47 # Current number of processed clauses : 11
% 0.19/0.47 # Positive orientable unit clauses : 5
% 0.19/0.47 # Positive unorientable unit clauses: 0
% 0.19/0.47 # Negative unit clauses : 1
% 0.19/0.47 # Non-unit-clauses : 5
% 0.19/0.47 # Current number of unprocessed clauses: 1
% 0.19/0.47 # ...number of literals in the above : 6
% 0.19/0.47 # Current number of archived formulas : 0
% 0.19/0.47 # Current number of archived clauses : 10
% 0.19/0.47 # Clause-clause subsumption calls (NU) : 11
% 0.19/0.47 # Rec. Clause-clause subsumption calls : 3
% 0.19/0.47 # Non-unit clause-clause subsumptions : 0
% 0.19/0.47 # Unit Clause-clause subsumption calls : 1
% 0.19/0.47 # Rewrite failures with RHS unbound : 0
% 0.19/0.47 # BW rewrite match attempts : 0
% 0.19/0.47 # BW rewrite match successes : 0
% 0.19/0.47 # Condensation attempts : 21
% 0.19/0.47 # Condensation successes : 0
% 0.19/0.47 # Termbank termtop insertions : 1047
% 0.19/0.47 # Search garbage collected termcells : 105
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.003 s
% 0.19/0.47 # System time : 0.002 s
% 0.19/0.47 # Total time : 0.005 s
% 0.19/0.47 # Maximum resident set size: 1764 pages
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.003 s
% 0.19/0.47 # System time : 0.005 s
% 0.19/0.47 # Total time : 0.007 s
% 0.19/0.47 # Maximum resident set size: 1704 pages
% 0.19/0.47 % E---3.1 exiting
% 0.19/0.47 % E exiting
%------------------------------------------------------------------------------